Exact and Heuristic Algorithms for the Indel Maximum Likelihood Problem
نویسندگان
چکیده
منابع مشابه
Exact and Heuristic Algorithms for the Indel Maximum Likelihood Problem
Given a multiple alignment of orthologous DNA sequences and a phylogenetic tree for these sequences, we investigate the problem of reconstructing the most likely scenario of insertions and deletions capable of explaining the gaps observed in the alignment. This problem, that we called the Indel Maximum Likelihood Problem (IMLP), is an important step toward the reconstruction of ancestral genomi...
متن کاملHeuristic and exact algorithms for Generalized Bin Covering Problem
In this paper, we study the Generalized Bin Covering problem. For this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. To nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. By computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملheuristic and exact algorithms for generalized bin covering problem
in this paper, we study the generalized bin covering problem. for this problem an exact algorithm is introduced which can nd optimal solution for small scale instances. to nd a solution near optimal for large scale instances, a heuristic algorithm has been proposed. by computational experiments, the eciency of the heuristic algorithm is assessed.
متن کاملDevelopment and Experimental Comparison of Exact and Heuristic Algorithms for the Maximum-Leaf Spanning Tree Problem
Given a connected, undirected and unweighted graph G, the maximum leaf spanning tree problem (MLSTP) is to find the spanning tree of G, that has the maximum number of leaves. In this report, we present experimental evaluation of the performance of exact algorithms for this problem and several heuristic solutions. The heuristic which we propose is a constructive heuristic. We evaluate the algori...
متن کاملExact and Heuristic Algorithms for the Partition Coloring Problem
We study the Partition Coloring Problem (PCP), a generalization of the Vertex Coloring Problem where the vertex set is partitioned. The PCP asks to select one vertex for each subset of the partition in such a way that the chromatic number of the induced graph is minimum. We propose a new Integer Linear Programming formulation with an exponential number of variables. To solve this formulation to...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational Biology
سال: 2007
ISSN: 1066-5277,1557-8666
DOI: 10.1089/cmb.2007.a006